Nowhere dense graph classes, stability, and the independence property
نویسندگان
چکیده
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the earlier stability theoretic notion of superflatness. For subgraph-closed classes of graphs we prove equivalence to stability and to not having the independence property.
منابع مشابه
Characterisations of Nowhere Dense Graphs
Nowhere dense classes of graphs were introduced by Nešetřil and Ossona de Mendez as a model for “sparsity” in graphs. It turns out that nowhere dense classes of graphs can be characterised in many different ways and have been shown to be equivalent to other concepts studied in areas such as (finite) model theory. Therefore, the concept of nowhere density seems to capture a natural property of g...
متن کاملOn the number of types in sparse graphs
We prove that for every class of graphs C which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [27, 28], and for every first order formula φ(x̄, ȳ), whenever one draws a graph G ∈ C and a subset of its nodes A, the number of subsets of A|ȳ| which are of the form {v̄ ∈ A|ȳ| : G |= φ(ū, v̄)} for some valuation ū of x̄ in G is bounded by O(|A||x̄|+ε), for every ε > 0. This provides optim...
متن کاملSparse Combinatorial Structures: Classification and Applications
We present results of the recent research on sparse graphs and finite structures in the context of of contemporary combinatorics, graph theory, model theory and mathematical logic, complexity of algorithms and probability theory. The topics include: complexity of subgraphand homomorphismproblems; model checking problems for first order formulas in special classes; property testing in sparse cla...
متن کاملParameterized Complexity of First-Order Logic
We show that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C. As all graph classes which exclude a xed minor, or are of bounded local tree-width or locally exclude a minor are nowhere dense, this generalises algorithmic meta-theorems obtained for these classes in the past (see [11, 13, 4]). Conversely, if C is not nowhere dense and ...
متن کاملNeighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs
We prove that whenever G is a graph from a nowhere dense graph class C, and A is a subset of vertices of G, then the number of subsets of A that are realized as intersections of A with r-neighborhoods of vertices of G is at most f(r, ε) · |A|, where r is any positive integer, ε is any positive real, and f is a function that depends only on the class C. This yields a characterization of nowhere ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1011.4016 شماره
صفحات -
تاریخ انتشار 2010